Minimization via duality

We show how to use duality theory to construct minimized versions of a wide class of automata. We work out three cases in detail: (a variant of) ordinary automata, weighted automata and probabilistic automata. The basic idea is that instead of constructing a maximal quotient we go to the dual and look for a minimal subalgebra and then return to the original category. Duality ensures that the minimal subobject becomes the maximally quotiented object

Dualities for modal algebras from the point of view of triples

In this paper we show how the theory of monads can be used to deduce in a uniform manner several duality theorems involving categories of relations on one side and categories of algebras with homomorphisms preserving only some operations on the other. Furthermore, we investigate the monoidal structure induced by Cartesian product on the relational side and show that in some cases the corresponding operation on the algebraic side represents bimorphisms